Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
fib(0) → 0
fib(s(0)) → s(0)
fib(s(s(0))) → s(0)
fib(s(s(x))) → sp(g(x))
g(0) → pair(s(0), 0)
g(s(0)) → pair(s(0), s(0))
g(s(x)) → np(g(x))
sp(pair(x, y)) → +(x, y)
np(pair(x, y)) → pair(+(x, y), x)
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
fib(0) → 0
fib(s(0)) → s(0)
fib(s(s(0))) → s(0)
fib(s(s(x))) → sp(g(x))
g(0) → pair(s(0), 0)
g(s(0)) → pair(s(0), s(0))
g(s(x)) → np(g(x))
sp(pair(x, y)) → +(x, y)
np(pair(x, y)) → pair(+(x, y), x)
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic Path Order [19].
Precedence:
fib1 > g1 > 0 > [s1, pair2]
fib1 > g1 > [sp1, np1, +2] > [s1, pair2]